Dynamic Initial Weight Assignment for MaxSAT
نویسندگان
چکیده
منابع مشابه
Solving #SAT and MAXSAT by Dynamic Programming
We look at dynamic programming algorithms for propositional model counting, also called #SAT, and MaxSAT. Tools from graph structure theory, in particular treewidth, have been used to successfully identify tractable cases in many subfields of AI, including SAT, Constraint Satisfaction Problems (CSP), Bayesian reasoning, and planning. In this paper we attack #SAT and MaxSAT using similar, but mo...
متن کاملWeight-Aware Core Extraction in SAT-Based MaxSAT Solving
Maximum satisfiability (MaxSAT) is today a competitive approach to tackling NP-hard optimization problems in a variety of AI and industrial domains. A great majority of the modern state-of-the-art MaxSAT solvers are core-guided, relying on a SAT solver to iteratively extract unsatisfiable cores of the soft clauses in the working formula and ruling out the found cores via adding cardinality cons...
متن کاملWeight Assignment Logic
We introduce a weight assignment logic for reasoning about quantitative languages of infinite words. This logic is an extension of the classical MSO logic and permits to describe quantitative properties of systems with multiple weight parameters, e.g., the ratio between rewards and costs. We show that this logic is expressively equivalent to unambiguous weighted Büchi automata. We also consider...
متن کاملAlgorithms for Dynamic Channel Assignment
The eeciency of channel assignment in a cellular telephone system is considered using the measures of successful channel assignment ratio as well as response time. Existing paradigms of mutual exclusion and dining philosophers from distributed systems are used to synthesize new algorithms that optimize both measures. The results are veriied by extensive simulations.
متن کاملApproximation Algorithms for Maxsat
The main aim of NP-completeness theory is the analysis of intractabil-ity. Many optimization problems were rst proved to be NP-hard. Since the complete solution of these problems requires exponential time, polynomial time algorithms to nd \near-optimal" solutions, i.e., approximation algorithms, appear to be viable. In this paper we show the basic principles of Approximation Theory for NP-compl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2021
ISSN: 1999-4893
DOI: 10.3390/a14040115